Coding Opportunity Densification Strategies for Instantly Decodable Network Coding
نویسندگان
چکیده
منابع مشابه
On Minimizing Multicast Completion Delay for Instantly Decodable Network Coding
In this paper, we consider the problem of minimizing the mean completion delay in wireless multicast for instantly decodable network coding. We first formulate the problem as a stochastic shortest path (SSP) problem. Although finding the optimal selection policy using SSP is intractable, we use this formulation to draw the theoretical properties of efficient selection algorithms. Based on these...
متن کاملFrom Instantly Decodable to Random Linear Network Coding
Our primary goal in this paper is to traverse the performance gap between two linear network coding schemes: random linear network coding (RLNC) and instantly decodable network coding (IDNC) in terms of throughput and decoding delay. We first redefine the concept of packet generation and use it to partition a block of partially-received data packets in a novel way, based on the coding sets in a...
متن کاملInstantly decodable network coding for real-time device-to-device communications
This paper studies the delay reduction problem for instantly decodable network coding (IDNC)-based device-todevice (D2D) communication-enabled networks. Unlike conventional point-to-multipoint (PMP) systems in which the wireless base station has the sufficient computation abilities, D2D networks rely on battery-powered operations of the devices. Therefore, a particular emphasis on the computati...
متن کاملInstantly Decodable versus Random Linear Network Coding: A Comparative Framework for Throughput and Decoding Delay Performance
This paper studies the tension between throughput and decoding delay performance of two widely-used network coding schemes: random linear network coding (RLNC) and instantly decodable network coding (IDNC). A single-hop broadcasting system model is considered that aims to deliver a block of packets to all receivers in the presence of packet erasures. For a fair and analytically tractable compar...
متن کاملDelay Minimization for Instantly Decodable Network Coding in Persistent Channels with Feedback Intermittence
In this paper, we consider the problem of minimizing the multicast decoding delay of generalized instantly decodable network coding (G-IDNC) over persistent forward and feedback erasure channels with feedback intermittence. In such environment, the sender does not always receive acknowledgement from the receivers after each transmission. Moreover, both the forward and feedback channels are subj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2013
ISSN: 0090-6778
DOI: 10.1109/tcomm.2013.102313.110741